Efficiency and Equilibrium in Task Allocation Economies with Hierarchical Dependencies

نویسندگان

  • William E. Walsh
  • Michael P. Wellman
چکیده

We analyze economic e ciency and equilibrium properties in decentralized task allocation problems involving hierarchical dependencies and resource contention. We bound the ine ciency of a type of approximate equilibrium in proportion to the number of agents and the bidding parameters in a particular market protocol. This protocol converges to an approximate equilibrium with respect to all agents, except those which may acquire unneeded inputs. We introduce a decommitment phase to allow such agents to decommit from their input contracts. Experiments indicate that the augmented market protocol produces highly efcient allocations on average.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extended version ( with proofs ) of a paper in Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence , 1999 E ciency and Equilibrium in Task Allocation

We analyze economic eeciency and equilibrium properties in decentralized task allocation problems involving hierarchical dependencies and resource contention. We bound the in-eeciency of a type of approximate equilibrium in proportion to the number of agents and the bidding parameters in a particular market protocol. This protocol converges to an approximate equilibrium with respect to all agen...

متن کامل

In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence , 1999 E ciency and Equilibrium in Task Allocation

We analyze economic eeciency and equilibrium properties in decentralized task allocation problems involving hierarchical dependencies and resource contention. We bound the in-eeciency of a type of approximate equilibrium in proportion to the number of agents and the bidding parameters in a particular market protocol. This protocol converges to an approximate equilibrium with respect to all agen...

متن کامل

International Joint Conference on Artificial Intelligence , 1999 E ciency and Equilibrium in Task Allocation

We analyze economic eeciency and equilibrium properties in decentralized task allocation problems involving hierarchical dependencies and resource contention. We bound the in-eeciency of a type of approximate equilibrium in proportion to the number of agents and the bidding parameters in a particular market protocol. This protocol converges to an approximate equilibrium with respect to all agen...

متن کامل

Integrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment

Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...

متن کامل

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999